Skip to content

Conversation

@Kritavya
Copy link

@Kritavya Kritavya commented Feb 8, 2026

Adds a Python port of the GraphX library.

  • Ports the core hashing and BFS traversal logic from the C++ implementation.
  • Uses dynamic adjacency lists for memory-efficient graph storage.
  • Supports integer and tuple-based nodes consistent with the C++ behavior.

Tested with directed and undirected graphs.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant